A hybrid heuristic approach of nurse scheduling problem

نویسنده

  • Xu Mai
چکیده

Purpose -Nurse scheduling problem is a key issue in strategic management in healthcare institutes. To improve the current manual-made nurse schedule, this paper presents a hybrid heuristic approach to generate weekly nurse schedule for a local Emergency Department (ED) in Hong Kong. Design/methodology/approach -A two-stage method is developed for the above purpose. In the first stage, approve-in-principle day-offs are manually inputted to scheduling system by nurse officer, then different types of shifts are assigned by simple heuristic algorithm satisfying all hard constraints. In the second stage, an alternative variable neighbourhood search approach is introduced as a post-processing procedure to incorporate the nurse preferences (soft constraints) into the schedule. Findings – Our approach produces high quality solutions and demonstrates a substantial level of user-friendliness and is flexible to adapt to alternative constraints adopted by other EDs. Originality/value -It is one of the few studies in nurse scheduling literature using heuristic model integrated with variable neighbourhood search algorithm to automatically generate nurse schedule in mere Excel spreadsheet. Our approach is superior over the traditional linear programming approach in terms of calculation time and user-friendliness.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines

In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...

متن کامل

A Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs

This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...

متن کامل

Solving a nurse rostering problem considering nurses preferences by graph theory approach

Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...

متن کامل

Maximizing the nurses’ preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm

The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses’ preferences for working shifts and weekends off by considering several important...

متن کامل

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012